Digital Surface Regularization With Guarantees

نویسندگان

چکیده

Voxel based modeling is a very attractive way to represent complex multi-material objects. Beside artistic choices of pixel/voxel arts, representing objects as voxels allows efficient and dynamic interactions with the scene. For geometry processing purposes, many applications in material sciences, medical imaging or numerical simulation rely on regular partitioning space labeled voxels. In this article, we consider variational approach reconstruct interfaces multi-labeled digital images. This efficiently produces piecewise smooth quadrangulated surfaces some theoretical stability guarantee. Non-manifold parts at intersecting are handled naturally by our model. We illustrate strength tool for surface regularization, well voxel art regularization transferring colorimetric information regularized quads computing isotropic geodesic surfaces.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regularization Paths with Guarantees for Convex Semidefinite Optimization

We devise a simple algorithm for computing an approximate solution path for parameterized semidefinite convex optimization problems that is guaranteed to be ε-close to the exact solution path. As a consequence, we can compute the entire regularization path for many regularized matrix completion and factorization approaches, as well as nuclear norm or weighted nuclear norm regularized convex opt...

متن کامل

Digital Surface Regularization by Normal Vector Field Alignment

Digital objects and digital surfaces are isothetic structures per se. Such surfaces are thus not adapted to direct visualization with isothetic quads, or to many geometry processing methods. We propose a new regularization technique to construct a piecewise smooth quadrangulated surface from a digital surface. More formally we propose a variational formulation which efficiently regularizes digi...

متن کامل

Inverse Problem Regularization with Weak Decomposable Priors. Part I: Recovery Guarantees

This first talk is dedicated to assessing the theoretical recovery performance of this class of regularizers. We consider regularizations with convex positively 1homogenous functionals (in fact gauges) which obey a weak decomposability property. The weak decomposability will promote solutions of the inverse problem conforming to some notion of simplicity/low complexity by living on a low dimens...

متن کامل

Triangulated Surface Denoising using High Order Regularization with Dynamic Weights

Recovering high quality surfaces from noisy triangulated surfaces is a fundamental important problem in geometry processing. Sharp features including edges and corners can not be well preserved in most existing denoising methods except the recent total variation (TV) and `0 regularization methods. However, these two methods have suffered producing staircase artifacts in smooth regions. In this ...

متن کامل

Adaptive regularization using the entire solution surface.

Several sparseness penalties have been suggested for delivery of good predictive performance in automatic variable selection within the framework of regularization. All assume that the true model is sparse. We propose a penalty, a convex combination of the L1- and L∞-norms, that adapts to a variety of situations including sparseness and nonsparseness, grouping and nongrouping. The proposed pena...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics

سال: 2021

ISSN: ['1077-2626', '2160-9306', '1941-0506']

DOI: https://doi.org/10.1109/tvcg.2021.3055242